Project-Team:GRACE

Project-Team Grace

Members

Overall Objectives

Scientific foundations

Research Program

Algorithmic Number Theory
Arithmetic Geometry: Curves and their Jacobians
Curve-Based cryptology
Algebraic Coding Theory

Application Domains

Cryptography and Cryptanalysis

New Software and Platforms

CADO-NFS-DLOG
Fast Compact Diffie–Hellman software
Platforms

New Results

Highlights of the Year
Diffusion layers for block ciphers
Rank metric codes over infinite fields
Tensor rank of multiplication over finite fields
Filtration Attacks against McEliece Cryptosystem
A new bound on the number of rational points of arbitrary projective varieties
New families of fast elliptic curves
New results for solving the discrete logarithm problem
Quantum Integer Factorization

Bilateral Contracts and Grants with Industry

Bilateral Contracts with Industry

Partnerships and Cooperations

Regional Initiatives
National Initiatives
European Initiatives
International Initiatives
International Research Visitors

Dissemination

Promoting Scientific Activities
Teaching - Supervision - Juries
Invitations to seminars and conferences
Popularization
Institutional commitment

Bibliography

Major publications
Publications of the year
References in notes

Inria | Raweb 2014 | Presentation of the Project-Team GRACE | GRACE Web Site


	PDF	e-Pub

Previous |

Home | Next next

Section: New Results

Quantum Integer Factorization

Together with two researchers in quantum physics (F. Grosshans and T. Lawson), F. Morain and B. Smith have been working on the number theoretical postprocessing in Shor's algorithm. A preprint is being written.

Previous |

Home | Next next